Well-Founded Touch Optimization for Futures
نویسندگان
چکیده
The future annotations of MultiLisp provide a simple method for taming the implicit par allelism of functional programs but require touch operations within all placeholder strict prim itives to ensure proper synchronization between threads These touch operations contribute substantially to program execution times We use an operational semantics of future devel oped in a previous paper to derive a program analysis algorithm and an optimization algorithm based on the analysis that removes provably redundant touch operations Experiments with the Gambit compiler indicate that this optimization substantially reduces program execution times Supported in part by NSF grant CCR and a sabbatical at Carnegie Mellon University
منابع مشابه
The Milling of Metalsthrough Adaptive Neuro-FuzzyInference System (ANFIS) for non-touch Measuring of the Temperature to Reduce Coolant
In this paper, an innovated method is used for cooling Milling zone of Stainless Steel via Adaptive Neuro-Fuzzy Inference System (ANFIS) using non-touch laser thermometer for non-touch measuring of the temperature. This method is economically appropriate because of its optimization in using coolant. In comparison to the ways which were designed to optimize the ratio of coolant, this method is t...
متن کاملRedreaming Australia: an introduction
Redreaming Australia: an introduction This special issue of Futures, Redreaming Australia, celebrates the rather fuzzy fifteenth anniversary of Imagine The Future Inc.[1], a very small yet influential project-based cultural development and ‘applied futures’ organisation I founded in Melbourne, Australia. ITF was conceived and developed when sustainability discourses were being institutionalised...
متن کاملBottom-Up Evaluation and Query Optimization of Well-Founded Models
We present a bottom-up operational procedure for computing well-founded models of allowed programs with negation. This procedure provides a practical method of handling programs that involve unstratiied negation in a manner that may be mixed with other evaluation approaches, such as semi-naive evaluation and various program transformations. We deene classes of programs and sideways information ...
متن کاملConstraint Strati cation in Deductive Databases
We propose a syntactic condition on deductive database programs that ensures a two-valued well-founded model. This condition, called constraint stratiication, is signiicantly more general than previous syntactic conditions such as stratiication and local stratiication. Modular stratiication has been proposed as a semantic (i.e., nonsyntactic) condition for ensuring a two-valued well-founded mod...
متن کاملConstraint Stratification in Deductive Databases
We propose a syntactic condition on deductive database programs that ensures a two-valued well-founded model. This condition, called constraint stratiication, is signiicantly more general than previous syntactic conditions such as stratiication and local stratiication. Modular stratiication has been proposed as a semantic (i.e., nonsyntactic) condition for ensuring a two-valued well-founded mod...
متن کامل